package cs561.hao;

import java.util.ArrayList;

class treeNode {
	//public int[] point = new int[5];
	public int indexInParent;//cost from root to this point
	public boolean root;
	public boolean leaf;
	public int x;//k
	public int y;
	public int vector_i;
	public int vector_j;//k-1
	public int g;
	public int h;
	boolean altRoot;
	public ArrayList<treeNode> childrenList = new ArrayList<treeNode>();//why not just one child, no grand child?
	public treeNode parent = null;
	
	public void addChild(treeNode child) {
		child.parent = this;
		child.root = false;
		child.leaf = true;
		child.indexInParent = childrenList.size();
		child.g = this.g + 1;
		childrenList.add(child);
		this.leaf =false;		
	}	
}